54 research outputs found
A most compendious and facile quantum de Finetti theorem
In its most basic form, the finite quantum de Finetti theorem states that the reduced k-partite density operator of an n-partite symmetric state can be approximated by a convex combination of k-fold product states. Variations of this result include Renner's “exponential” approximation by “almost-product” states, a theorem which deals with certain triples of representations of the unitary group, and the result of D'Cruz et al. [e-print quant-ph/0606139;Phys. Rev. Lett. 98, 160406 (2007)] for infinite-dimensional systems. We show how these theorems follow from a single, general de Finetti theorem for representations of symmetry groups, each instance corresponding to a particular choice of symmetry group and representation of that group. This gives some insight into the nature of the set of approximating states and leads to some new results, including an exponential theorem for infinite-dimensional systems
Counterfactual Computation
Suppose that we are given a quantum computer programmed ready to perform a
computation if it is switched on. Counterfactual computation is a process by
which the result of the computation may be learnt without actually running the
computer. Such processes are possible within quantum physics and to achieve
this effect, a computer embodying the possibility of running the computation
must be available, even though the computation is, in fact, not run. We study
the possibilities and limitations of general protocols for the counterfactual
computation of decision problems (where the result r is either 0 or 1). If p(r)
denotes the probability of learning the result r ``for free'' in a protocol
then one might hope to design a protocol which simultaneously has large p(0)
and p(1). However we prove that p(0)+p(1) never exceeds 1 in any protocol and
we derive further constraints on p(0) and p(1) in terms of N, the number of
times that the computer is not run. In particular we show that any protocol
with p(0)+p(1)=1-epsilon must have N tending to infinity as epsilon tends to 0.
These general results are illustrated with some explicit protocols for
counterfactual computation. We show that "interaction-free" measurements can be
regarded as counterfactual computations, and our results then imply that N must
be large if the probability of interaction is to be close to zero. Finally, we
consider some ways in which our formulation of counterfactual computation can
be generalised.Comment: 19 pages. LaTex, 2 figures. Revised version has some new sections and
expanded explanation
Sparse Graph Codes for Quantum Error-Correction
We present sparse graph codes appropriate for use in quantum
error-correction. Quantum error-correcting codes based on sparse graphs are of
interest for three reasons. First, the best codes currently known for classical
channels are based on sparse graphs. Second, sparse graph codes keep the number
of quantum interactions associated with the quantum error correction process
small: a constant number per quantum bit, independent of the blocklength.
Third, sparse graph codes often offer great flexibility with respect to
blocklength and rate. We believe some of the codes we present are unsurpassed
by previously published quantum error-correcting codes.Comment: Version 7.3e: 42 pages. Extended version, Feb 2004. A shortened
version was resubmitted to IEEE Transactions on Information Theory Jan 20,
200
How many photons are needed to distinguish two transparencies?
We give a bound on the minimum number of photons that must be absorbed by any
quantum protocol to distinguish between two transparencies. We show how a
quantum Zeno method in which the angle of rotation is varied at each iteration
can attain this bound in certain situations.Comment: 5 pages, 4 figure
Sequential weak measurement
The notion of weak measurement provides a formalism for extracting
information from a quantum system in the limit of vanishing disturbance to its
state. Here we extend this formalism to the measurement of sequences of
observables. When these observables do not commute, we may obtain information
about joint properties of a quantum system that would be forbidden in the usual
strong measurement scenario. As an application, we provide a physically
compelling characterisation of the notion of counterfactual quantum
computation
- …